Magnitude Relation Properties of Radix-2k SD Number

High Speed Modulo Calculation Algorithm with Radix-2k SD Number

In RSA Cryptograms, many modulo calculations are used, but modulo calculation is based on many subtractions and it takes long time to calculate. In this article, we explain about a new modulo calculation algorithm using table. And we proof that upper 3 digits of Radix-2k SD numbers is enough to specify the answer. In the first section, we prepared some useful theorems for operations of Radix-2k...

An Efficient Multi-Path Delay Commutator Architecture

The Appearance of radix-22 was a milestone in the design of pipelined FFT hardware architectures. Later, radix-22 was extended to radix-2K. In the feed forward architectures radix-2K can be used for any number of parallel samples which is a power of two. Indeed, it is shown that feed forward structures are more efficient than feedback ones when several samples in parallel must be processed. As ...

High-Speed Algorithms for RSA Cryptograms

In this article, we propose a new high-speed processing method for encoding and decoding the RSA cryptogram that is a kind of public-key cryptogram. This cryptogram is not only used for encrypting data, but also for such purposes as authentication. However, the encoding and decoding processes take a long time because they require a great deal of calculations. As a result, this cryptogram is not...

Some Properties of Certain Subclasses of Close-to-Convex and Quasi-convex Functions with Respect to 2k-Symmetric Conjugate Points

Pipelined Radix-2k Feedforward FFT Architectures

The appearance of radix-2 was a milestone in the design of pipelined FFT hardware architectures. Later, radix-2 was extended to radix-2. However, radix-2 was only proposed for Single-path Delay Feedback (SDF) architectures, but not for feedforward ones, also called Multi-path Delay Commutator (MDC). This paper presents the radix-2 feedforward (MDC) FFT architectures. In feedforward architecture...